Generalized Layerings for Arbitrary and Fixed Drawing Areas
نویسندگان
چکیده
منابع مشابه
A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملFixed-Point Ellipse Drawing Algorithm
This algorithm draws ellipses with integer centres and decimal radii on discrete devices using fixed-point arithmetic. These ellipses have both X and Y axis parallel to the coordinate axes. It uses forward differences to diminish its cost. It has a low comp utational complexity while the error is lower than traditional algorithms. This algorithm works in the squared R space (fixed-point) and tr...
متن کاملFixed-Location Circular-Arc Drawing
In this paper we consider the problem of drawing a planar graph using circular-arcs as edges and given a one-to-one mapping between the vertices of the graph and a set of n points on the plane, where n is the number of vertices in the graph. If for every edge we have only two possible circular arcs, then there a simple reduction to 2SAT yields an O(n) algorithm to find out if a drawing with no ...
متن کاملCommon Fixed-Point Theorems For Generalized Fuzzy Contraction Mapping
In this paper we investigate common xed point theorems for contraction mapping in fuzzy metric space introduced by Gregori and Sapena [V. Gregori, A. Sapena, On xed-point the- orems in fuzzy metric spaces, Fuzzy Sets and Systems, 125 (2002), 245-252].
متن کاملDrawing Planar Graphs with Prescribed Face Areas
This thesis deals with planar drawings of planar graphs such that each interior face has a prescribed area. Our work is divided into two main sections. The first one deals with straight-line drawings and the second one with orthogonal drawings. For straight-line drawings, it was known that such drawings exist for all planar graphs with maximum degree 3. We show here that such drawings exist for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2017
ISSN: 1526-1719
DOI: 10.7155/jgaa.00441